منابع مشابه
Framed temporal logic programming
A Projection Temporal Logic is discussed and some of its laws are given. After that, an executable temporal logic programming language, called Framed Tempura, is formalized. A minimal model-based approach for framing in temporal logic programming is presented. Since framing destroys monotonicity, canonical models – used to define the semantics of non-framed programs – are no longer appropriate....
متن کاملClocked Temporal Logic Programming
Clocked temporal logic programming(CTLP) is an extension of logic programming based on a clocked temporal logic(CTL). In CTL, predicates are associated with local clocks. Local clocks can be used to model multiple granularity of time, thus the resulting temporal logic programming language, called Chronolog(MC), has a stronger modeling power. This paper discusses the logical basis of the languag...
متن کاملTemporal Annotated Constraint Logic Programming
We introduce a family of logics and associated programming languages for representing and reasoning about time. The family is conceptually simple while allowing for different models of time. Formulas can be labeled with temporal information using annotations. In this way we avoid the proliferation of variables and quantifiers as encountered in first order approaches. Unlike temporal logic, both...
متن کاملTemporal and Modal Logic Programming :
This paper presents a structured, annotated bibliography of extensions of logic programming based on temporal and modal logics. Temporal and modal logic programming is a new area of research, which gained momentum in the late 1980'ies. The paper discusses temporal and modal logic programming under three headings: (1) interval logic programming , (2) temporal logic programming, and (3) modal log...
متن کاملTowards Temporal Constraint Logic Programming
Eddie Schwalb2 and Llu s Vila3 Abstract. We aim at developing a logic-based representation language which supports an explicit representation of time and temporal constraints such as \the task t takes from 3 to 4 hours", \the resource r is available from 8:00 to 11:00 and from 13:00 to 14:00" and \task ti cannot overlap task tj". In this paper we discuss the issues to address and we propose TCL...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2008
ISSN: 0167-6423
DOI: 10.1016/j.scico.2007.09.001